A simplex algorithm for rational cp-factorization
نویسندگان
چکیده
منابع مشابه
A lifting and recombination algorithm for rational factorization of sparse polynomials
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm of Lecerf, with now a polynomial complexity in the volume of the Newton polytope. We adopt a geometrical point of view, the main tool being derived from som...
متن کاملA HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION
In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...
متن کاملA new technique for the Simplex basis LU factorization update
The objective of this work is to develop more efficient alternatives for Simplex method implementation. Techniques of the Simplex basis LU factorization update are developed to improve the solution of the Simplex method linear systems to achieve a column static reordering of the matrix. A simulation of the Simplex method is implemented, with the change of basis obtained from MINOS. Only the fac...
متن کاملNon-rational covers of CP n ×CP m
The aim of this article is to provide further examples of higher dimensional varieties which are rationally connected, but not rational and not even ruled. The original methods of [Iskovskikh-Manin71; Clemens-Griffiths72] were further developed by many authors (for instance, [Beauville77; Iskovskikh80; Bardelli84]) and they give a quite complete picture in dimension three. [Corti96] is a recent...
متن کاملA fast algorithm for general matrix factorization
Matrix factorization algorithms are emerging as popular tools in many applications, especially dictionary learning method for recovering biomedical image data from noisy and ill-conditioned measurements. We introduce a novel dictionary learning algorithm based on augmented Lagrangian (AL) approach to learn dictionaries from exemplar data and it can be extended to general matrix factorization pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01467-4